A General Framework for Nonlinear Regularized Krylov-Based Image Restoration

نویسندگان

  • Serena Morigi
  • Lothar Reichel
  • Fiorella Sgallari
چکیده

This paper introduces a new approach to computing an approximate solution of Tikhonov-regularized large-scale ill-posed problems with a general nonlinear regularization operator. The iterative method applies a sequence of projections onto generalized Krylov subspaces using a semi-implicit approach to deal with the nonlinearity in the regularization term. A suitable value of the regularization parameter is determined by the discrepancy principle. Computed examples illustrate the performance of the method applied to the restoration of blurred and noisy images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Acceleration Methods for Total Variation-Based Image Denoising

For a given blur, we apply a fixed point method to solve the total variation-based image restoration problem. A new algorithm for the discretized system is presented. Convergence of outer iteration is efficiently improved by adding a linear term on both sides of the system of nonlinear equations. In inner iteration, an algebraic multigrid (AMG) method is applied to solve the linearized systems ...

متن کامل

Frequency Domain Adaptive Iterative Image Restoration and Evaluation of the Regularization Parameter

In this paper a nonlinear frequency domain adaptive regularized iterative image restoration algorithm is proposed, according to which the regularization parameter is frequency dependent and is updated at each iteration step. The development of the algorithm is based on a set theoretic regularization approach, where bounds on the error residual and the stabilizing functional are updated in the f...

متن کامل

Investigation of Parallel and Globally Convergent Iterative Schemes for Nonlinear Variational Image Smoothing and Segmentation

We consider a non{quadratic convex variational seg-mentation approach and investigate numerical schemes to allow for an eecient computation of the global minimum on a parallel architecture. We focus on iterative schemes for which we can show global convergence to the unique solution irrespective of the starting point. In the context of (semi{)automated image processing tasks, such a feature is ...

متن کامل

Majorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration

A new majorization-minimization framework for lp-lq image restoration is presented. The solution is sought in a generalized Krylov subspace that is build up during the solution process. Proof of convergence to a stationary point of the minimized lp-lq functional is provided for both convex and nonconvex problems. Computed examples illustrate that high-quality restorations can be determined with...

متن کامل

Iterative evaluation of the regularization parameter in regularized image restoration

In this paper a nonlinear regularized iterative image restoration algorithm is proposed, according to which no prior knowledge about the noise variance is assumed. The algorithm results from a set-theoretic regularization approach, where bounds of the stabilizing functional and the noise variance, which determine the reg-ularization parameter, are updated at each iteration step. Sufficient cond...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014